Reconstruction of graphs based on random walks
نویسندگان
چکیده
منابع مشابه
Reconstruction of graphs based on random walks
The analysis of complex networks is of major interest in various fields of science. In many applications we face the challenge that the exact topology of a network is unknown but we are instead given information about distances within this network. The theoretical approaches to this problem have so far been focusing on the reconstruction of graphs from shortest path distance matrices. Often, ho...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملRandom walks on graphs
Let G = (V,E) be a connected, undirected graph. We shall consider the following model of a random walk on G. The walk starts out at time 0 in some initial distribution on the vertex set V ; the initial condition may be deterministic, which corresponds to the distribution assigning probability 1 to a single vertex. The random walk is constructed as follows. There are independent unit rate Poisso...
متن کاملBranching Random Walks on Graphs
We study a new distributed randomized information propagation mechanism in networks that we call a branching random walk (BRW). BRW is a generalization of the well-studied “standard” random walk which is a fundamental primitive useful in a wide variety of network applications ranging from token management and load balancing to search, routing, information propagation and gossip. BRW is paramete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.05.026